Indonesian Commercial Woods Classification Based on GLCM and K-Nearest Neighbor

نویسندگان

چکیده

Currently, the presence of wood is becoming increasingly scarce. In addition, recognition still using experts, who basing their judgments on characteristics that can be seen by eye directly such as color, texture and so on. However, experts are few have a disadvantage results obtained not sufficiently accurate time consuming. The purpose this research to develop Indonesian commercial woods classification system based GLCM k-Nearest Neighbor. Procedures includes image acquisition digital camera, then preprocessing steps converting original grayscale sharpening image, after do feature extraction Gray Level Cooccurrence Matrix (GLCM) with parameters used Contrast, Correlation , Energy, Entropy, Homogeneity, at each direction 0°, 45°, 90°, 135°,and last step Neighbor (k-NN). testing show data classified accurately 100% derived from training database k = 1. general, greater value success rate decreases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

k-Nearest Neighbor Classification on Spatial Data

Classification of spatial data streams is crucial, since the training dataset changes often. Building a new classifier each time can be very costly with most techniques. In this situation, k-nearest neighbor (KNN) classification is a very good choice, since no residual classifier needs to be built ahead of time. KNN is extremely simple to implement and lends itself to a wide variety of variatio...

متن کامل

Weighted K-Nearest Neighbor Classification Algorithm Based on Genetic Algorithm

K-Nearest Neighbor (KNN) is one of the most popular algorithms for data classification. Many researchers have found that the KNN algorithm accomplishes very good performance in their experiments on different datasets. The traditional KNN text classification algorithm has limitations: calculation complexity, the performance is solely dependent on the training set, and so on. To overcome these li...

متن کامل

Problem Set 1 K-nearest Neighbor Classification

In this part, you will implement k-Nearest Neighbor (k-NN) algorithm on the 8scenes category dataset of Oliva and Torralba [1]. You are given a total of 800 labeled training images (containing 100 images for each class) and 1888 unlabeled testing images. Figure 1 shows some sample images from the data set. Your task is to analyze the performance of k-NN algorithm in classifying photographs into...

متن کامل

IKNN: Informative K-Nearest Neighbor Pattern Classification

The K-nearest neighbor (KNN) decision rule has been a ubiquitous classification tool with good scalability. Past experience has shown that the optimal choice of K depends upon the data, making it laborious to tune the parameter for different applications. We introduce a new metric that measures the informativeness of objects to be classified. When applied as a query-based distance metric to mea...

متن کامل

Privacy Preserving K-nearest Neighbor Classification

This paper considers how to conduct k-nearest neighbor classification in the following scenario: multiple parties, each having a private data set, want to collaboratively build a k-nearest neighbor classifier without disclosing their private data to each other or any other parties. Specifically, the data are vertically partitioned in that all parties have data about all the instances involved, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International journal of engineering and advanced technology

سال: 2022

ISSN: ['2249-8958']

DOI: https://doi.org/10.35940/ijeat.f3743.0811622